vertex cover meaning in English
点覆盖
Examples
- As applications of succeeding , numerical examples of max - cut and vertex cover are given
数值实验表明这种算法是求解较大规模半定规划问题的有效方法 - The simulation results show that the novel algorithm is more scalable than the traditional algorithms , and can find smaller weak vertex cover
仿真结果表明，比较现有算法，新算法能找出更小的弱顶点覆盖集，具有更好的可扩展性。 - But the classical vertex cover algorithm can not use in the cbvc problem directly , because the cbvc problem have more term need to constraint
但是，以上的算法并不能直接应用于受二分图约束的顶点覆盖问题( constraintbipartitevertexcover , cbvc )求解。 - Che [ 1 ] proposed a heuristic fault spectrum algorithm that solves the cbvc problem very efficient but still not guarantee the minimization of the set of vertex cover
Che在此前也曾提出过一种基于启发式的错误谱算法[ 1 ] ，有效提高了求解的效率。但该算法仍然存在不能保证最优解的问题。